An Assignment Problem Algorithm Using Minimum Cost Moving Method
نویسندگان
چکیده
منابع مشابه
On the Minimum Cost Range Assignment Problem
We study the problem of assigning transmission ranges to radio stations placed arbitrarily in a d-dimensional (d-D) Euclidean space in order to achieve a strongly connected communication network with minimum total power consumption. The power required for transmitting in range r is proportional to r, where α is typically between 1 and 6, depending on various environmental factors. While this pr...
متن کاملLocomotive assignment problem with train precedence using genetic algorithm
This paper aims to study the locomotive assignment problem which is very important for railway companies, in view of high cost of operating locomotives. This problem is to determine the minimum cost assignment of homogeneous locomotives located in some central depots to a set of pre-scheduled trains in order to provide sufficient power to pull the trains from their origins to their destinations...
متن کاملAn efficient cost scaling algorithm for the assignment problem
The cost scaling push-relabel method has been shown to be efficient for solving minimum-cost flow problems. In this paper we apply the method to the assignment problem and investigate implementations of the method that take advantage of assignment's special structure. The results show that the method is very promising for practical use.
متن کاملA Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
متن کاملsolving quadratic assignment problem (qap) using invasive weed optimization algorithm
a new powerful optimization algorithm inspired from colonizing weeds is utilized to solve the well-known quadratic assignment problem (qap) which is of application in a large number of practical areas such as plant layout, machinery layout and so on. a set of reference numerical problems from qaplib is taken in order to evaluate the efficiency of the algorithm compared with the previous ones wh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Korea Society of Computer and Information
سال: 2015
ISSN: 1598-849X
DOI: 10.9708/jksci.2015.20.8.105